Small Strong Blocking Sets by Concatenation
نویسندگان
چکیده
Strong blocking sets and their counterparts, minimal codes, have attracted much attention in the past few years. Combining concatenating construction of codes with a geometric insight into minimality condition, we explicitly provide infinite families small strong sets, whose size is linear dimension ambient projective spaces. As byproduct, saturating are obtained.
منابع مشابه
On small blocking sets and their linearity
We prove that a small blocking set of PG(2, q) is “very close” to be a linear blocking set over some subfield GF(p) < GF(q). This implies that (i) a similar result holds in PG(n, q) for small blocking sets with respect to k-dimensional subspaces (0 ≤ k ≤ n) and (ii) most of the intervals in the interval-theorems of Szőnyi and Szőnyi-Weiner are empty.
متن کاملCharacterization results on small blocking sets
In [8], De Beule and Storme characterized the smallest blocking sets of the hyperbolic quadrics Q+(2n + 1, 3), n ≥ 4; they proved that these blocking sets are truncated cones over the unique ovoid of Q+(7, 3). We continue this research by classifying all the minimal blocking sets of the hyperbolic quadrics Q+(2n + 1, 3), n ≥ 3, of size at most 3n + 3n−2. This means that the three smallest minim...
متن کاملSmall Blocking Sets in Higher Dimensions
We show that small blocking sets in PG(n, q) with respect to hyperplanes intersect every hyperplane in 1 modulo p points, where q= p. The result is then extended to blocking sets with respect to k-dimensional subspaces and, at least when p>2, to intersections with arbitrary subspaces not just hyperplanes. This can also be used to characterize certain non-degenerate blocking sets in higher dimen...
متن کاملOn the stability of small blocking sets
A stability theorem says that a nearly extremal object can be obtained from an extremal one by “small changes”. In this paper, we study the relation of sets having few 0-secants and blocking sets.
متن کاملStrong Feature Sets from Small Samples
For small samples, classifier design algorithms typically suffer from overfitting. Given a set of features, a classifier must be designed and its error estimated. For small samples, an error estimator may be unbiased but, owing to a large variance, often give very optimistic estimates. This paper proposes mitigating the small-sample problem by designing classifiers from a probability distributi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2023
ISSN: ['1095-7146', '0895-4801']
DOI: https://doi.org/10.1137/21m145032x